Improved Heuristics for Short Linear Programs

Heuristics for Hard ASP Programs

We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ2 /Π P 2 hard ASP programs while maintaining the benign behaviour of the well-assessed heuristic of DLV on NP problems. We experiment with the new heuristic on QBFs. hDS significantly outperforms the heuristic of DLV on hard 2QBF problems. We compare also th...

Heuristics for Improved Enterprise Intrusion

One of the greatest challenges facing network operators today is the identification of malicious activity on their networks. The current approach is to deploy a set of intrusion detection sensors (IDSs) in various locations throughout the network and on strategic hosts. Unfortunately, the available intrusion detection technologies generate an overwhelming volume of false alarms, making the task...

An Improved Recurrence Method for Simple Continuous Linear Programs

⎯In this paper we discuss a special class of continuous linear programs called simple continuous linear programs (SP). In our recent paper [Wen et al. (2009)], we proposed a recurrence algorithm for solving (SP). The major computational works in the proposed algorithm are finding the global minimal values of the given continuous functions on 2 intervals. However, when n becomes large, it could ...

Improved smoothing-type methods for the solution of linear programs

Improved infeasible-interior-point algorithm for linear complementarity problems

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...